Description: 利用Huffman编码法做的一个文本文件压缩程序，仅支持英文的文本文档，压缩效率在10％~50％,DOS界面，欢迎讨论。-Huffman coding method used to do a text file compression program, supports only English text files, the compression efficiency of 10% to 50%, DOS interface, welcomed the discussion. Platform: |
Size: 17408 |
Author:enderlw |
Hits:
Description: 自适应的哈夫曼编码程序，包括屏幕输出和文件保存。-Adaptive Huffman Coding procedures, including the screen output and save the file. Platform: |
Size: 5120 |
Author:陈文杰 |
Hits:
Description: 静态的哈夫曼编码，从file.txt文件中读取字符，统计，并编码，输出到huffman-u.txt中-Static Huffman coding, the document read from file.txt characters, statistics, and coding, the output of the huffman-u.txt Platform: |
Size: 4096 |
Author:陈文杰 |
Hits:
Description: 哈夫曼编码的源程序，可以使用txt文件进行输入，并且输出到txt文件中。并且可以实现书结构的显示。-Huffman coding of source, you can use the txt file for input and output to txt file. Structure and can realize the book display. Platform: |
Size: 297984 |
Author:ligengyu |
Hits:
Description: Huffman编码，基于VC6.0开发平台，是Huffman于1952年为压缩文本文件建立的。-Huffman coding, based on VC6.0 development platform, is Huffman in 1952 for the compressed text file created. Platform: |
Size: 109568 |
Author:shen |
Hits:
Description: 哈夫曼编码：输入一个文本文件（英文文本），剔除其中的非英文字符，并将英文字符统一转化为大写字符，然后统计各个字符的出现概率。创建哈夫曼树，给出编码表（即各字符的码字）及编码效率（带权路径长度）-Huffman Coding: Enter a text file (English version), excluding one non-English characters and English characters converted to uppercase characters reunification, and then the emergence of statistical probability of the various characters. Create a Huffman tree, given encoding table (that is, the character code word) and the coding efficiency (with the right path length) Platform: |
Size: 1024 |
Author:k332 |
Hits:
Description: 用哈夫曼编码来存储文件，并和输入文本文件大小进行比较，计算文件压缩率-Huffman coding used to store documents, and to input text file size compared to the calculation file compression rate Platform: |
Size: 4096 |
Author:王平 |
Hits:
Description: 本演示程序提供了哈夫曼编码法的压缩和解压缩函数，并实现了对图象文件的压缩和解压缩-This demo provides a Huffman coding method of compression and decompression functions, and to realize the image file compression and decompression Platform: |
Size: 188416 |
Author:Garwolf |
Hits:
Description: I ve written some many years ago dynamic Huffman algorithm to compress and decompress data. It is mainly targeted to data with some symbols occuring more often than the rest (e.g. having some data file consisted of 3 different symbols and their total number of occurence in that file s1(1000), s2(200), s3(30) so the total length of file is 1000+200+30=1230 bytes, it will be encoded assigning one bit to s1 and 2 bits to s2, s3 so the encoded length will be 1*1000+2*(200+30)=1460 bits=182 bytes). In the best case the file consisted of just one symbol will be encoded with compression ratio as 1:8. Huffman coding is used in image compression, however in JPEG2000 arithmetic codec is imployed. Platform: |
Size: 7168 |
Author:毛磊 |
Hits:
Description: 利用哈夫曼编码实现对一个文本文件的内容加密，假设该文本文件只能包含小写字母、空格、逗号、和句号等字符。该程序是实现对文件中的字符进行编码、输出各个字符对应的编码、输出文件的哈夫曼编码。-The use of Huffman coding to achieve the contents of a text file encryption, the assumption that the text file can contain only lowercase letters, spaces, commas, and characters such as the full stop. The program is to achieve the document s character encoding, the output corresponding to the various character encoding, the Huffman coding output file. Platform: |
Size: 9216 |
Author:hulinjie |
Hits:
Description: 用哈夫曼编码进行文件压缩与解压，
通过输入文件名来计算字符种类与频数来计算权值-Huffman coding with file compression and decompression, the file name by entering the type and frequency to calculate the number of characters to calculate the weights Platform: |
Size: 10240 |
Author:陈雷 |
Hits:
Description: Huffman coding is a lossless data compression algorithm. Huffman coding uses variable length code to represent a symbol of the source (eg a character in a file). The code is determined from an estimate of the probabilities of appearance of the source symbols, a short code being associated with the most frequent source symbols.
A Huffman code is optimal in the sense of the shortest length for encoding by symbol, and a known probability distribution. More complex methods of probabilistic modeling of the source allow for better compression ratios. Platform: |
Size: 55296 |
Author:manelb |
Hits:
Description: Huffman coding is a lossless data compression algorithm. Huffman coding uses variable length code to represent a symbol of the source (eg a character in a file). The code is determined from an estimate of the probabilities of appearance of the source symbols, a short code being associated with the most frequent source symbols.
A Huffman code is optimal in the sense of the shortest length for encoding by symbol, and a known probability distribution. More complex methods of probabilistic modeling of the source allow for better compression ratios. Platform: |
Size: 15360 |
Author:malikab |
Hits:
Search - Huffman coding file